On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
نویسندگان
چکیده
منابع مشابه
Data Mining and Simulation Applied to a Staff Scheduling Problem
Staa scheduling is a complex problem encountered in almost all large businesses. Available manpower and skills must be deployed as eeectively as possible, while being exible enough to cope with the unexpected. This paper shows how high end PC technology in data-mining and simulation, as opposed to super-computing techniques, were applied to staa-scheduling in a large commercial organisation, wh...
متن کاملDomain-decomposed Fully Coupled Implicit Methods for a Magnetohydrodynamics Problem
1 University of Colorado at Boulder, Department of Computer Science, 430 UCB, Boulder, CO 80309, USA, [email protected] 2 Old Dominion University, Department of Computer Science, 3300 ECS Building, Norfolk, VA 23529, USA, [email protected] 3 University of Colorado at Boulder, Department of Computer Science, 430 UCB, Boulder, CO 80309, USA, [email protected] 4 Columbia Univers...
متن کاملBias toward Higher Performance for the Decomposed Network. Whether a Decomposed Network Would Learn
faster than a non-decomposed network when the number of weights in the two networks is approximately equal remains to be tested. Second, we performed a more extensive search in and space than [Kamm and Singhal, 1990], resulting in generally higher learning rates and training times of only a few epochs. The range of learning rates explored in the current study included higher rates than those ex...
متن کاملStaff Scheduling by a Genetic Algorithm
This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...
متن کاملApplying Computational Intelligence Approaches to the Staff Scheduling Problem
Staff scheduling for public organizations and institutions is an NP-hard problem and many heuristic optimization approaches have already been developed to solve it. In the present paper, we present two meta-heuristic computational intelligence approaches (Genetic Algorithms and Particle Swarm Optimization) for solving the Staff scheduling problem. A general model for the problem is introduced a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2007
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-007-0220-2